package com.jack.leetcode.eachproblem_2020;

public class 买卖股票的最佳时机含手续费 {

    public int maxProfit(int[] prices, int fee) {
        int n = prices.length;
        int[][] dp = new int[n][2];
        dp[0][0] = -prices[0];
        dp[0][1] = 0;
        for(int i = 1;i < n;i++){
            dp[i][1] = Math.max(prices[i] + dp[i - 1][0] - fee, dp[i - 1][1]);
            dp[i][0] = Math.max(dp[i - 1][1] - prices[i], dp[i - 1][0]);
        }
        return dp[n - 1][1];
    }
}
